Large Orbits of Supersolvable Linear Groups
نویسندگان
چکیده
منابع مشابه
Arithmetic Results on Orbits of Linear Groups
Let p be a prime and G a subgroup of GLd(p). We define G to be pexceptional if it has order divisible by p, but all its orbits on vectors have size coprime to p. We obtain a classification of p-exceptional linear groups. This has consequences for a well known conjecture in representation theory, and also for a longstanding question concerning 1 2 -transitive linear groups (i.e. those having all...
متن کاملComputing Irreducible Representations of Supersolvable Groups
Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time 0(n2 log«). We present an improved algorithm with running time 0(n log/?).
متن کاملList Decoding Group Homomorphisms Between Supersolvable Groups
We show that the set of homomorphisms between two supersolvable groups can be locally list decoded up to the minimum distance of the code, extending the results of Dinur et al who studied the case where the groups are abelian. Moreover, when specialized to the abelian case, our proof is more streamlined and gives a better constant in the exponent of the list size. The constant is improved from ...
متن کاملDensity of orbits of endomorphisms of commutative linear algebraic groups
We prove a conjecture of Medvedev and Scanlon for endomorphisms of connected commutative linear algebraic groups G defined over an algebraically closed field k of characteristic 0. That is, if Φ: G −→ G is a dominant endomorphism, we prove that one of the following holds: either there exists a non-constant rational function f ∈ k(G) preserved by Φ (i.e., f ◦ Φ = f), or there exists a point x ∈ ...
متن کاملComputing irreducible representations of supersolvable groups over small finite fields
We present an algorithm to compute a full set of irreducible representations of a supersolvable group G over a finite field K, charK |G|, which is not assumed to be a splitting field of G. The main subroutines of our algorithm are a modification of the algorithm of Baum and Clausen (Math. Comp. 63 (1994), 351–359) to obtain information on algebraically conjugate representations, and an effectiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1999
ISSN: 0021-8693
DOI: 10.1006/jabr.1998.7730